Fully Distrustful Quantum Cryptography
نویسندگان
چکیده
J. Silman, A. Chailloux, N. Aharon, I. Kerenidis, 5 S. Pironio, and S. Massar Laboratoire d’Information Quantique, Université Libre de Bruxelles, 1050 Bruxelles, Belgium LIAFA, Univ. Paris 7, F-75205 Paris, France; and Univ. Paris-Sud, 91405 Orsay, France School of Physics and Astronomy, Tel-Aviv University, Tel-Aviv 69978, Israel LIAFA, Univ. Paris 7 CNRS; F-75205 Paris, France Centre for Quantum Technologies, National University of Singapore, Singapore 117543 (Dated: January 26, 2011)
منابع مشابه
On the Power of Two-Party Quantum Cryptography
We study quantum protocols among two distrustful parties. Under the sole assumption of correctness— guaranteeing that honest players obtain their correct outcomes—we show that every protocol implementing a nontrivial primitive necessarily leaks information to a dishonest player. This extends known impossibility results to all non-trivial primitives. We provide a framework for quantifying this l...
متن کاملSecuring Distributed Systems with Information Flow Control
Recent operating systems [12, 21, 26] have shown that decentralized information flow control (DIFC) can secure applications built from mostly untrusted code. This paper extends DIFC to the network. We present DStar, a system that enforces the security requirements of mutually distrustful components through cryptography on the network and local OS protection mechanisms on each host. DStar does n...
متن کاملQuantifying the Leakage of Quantum Protocols for Classical Two-Party Cryptography
We study quantum protocols among two distrustful parties. By adopting a rather strict definition of correctness—guaranteeing that honest players obtain their correct outcomes only—we can show that every strictly correct quantum protocol implementing a non-trivial classical primitive necessarily leaks information to a dishonest player. This extends known impossibility results to all non-trivial ...
متن کاملComposability in quantum cryptography
If we combine two secure cryptographic systems, is the resulting system still secure? Answering this question is highly nontrivial and has recently sparked a considerable research effort, in particular, in the area of classical cryptography. A central insight was that the answer to the question is yes, but only within a well-specified composability framework and for carefully chosen security de...
متن کاملA provably secure code-based concurrent signature scheme
Concurrent signatures allow two entities to generate two signatures in such a way that both signatures are ambiguous till some information is revealed by one of the parties. This kind of signature is useful in auction protocols and a wide range of scenarios in which involving participants are mutually distrustful. In this paper, to have quantum-attack-resistant concurrent signatures as recommen...
متن کامل